Naïve Reverse Can be Linear

We propose a new implementation of logic programming with higher-order terms. In order to illustrate the properties of our implementation, we apply the coding of lists as functions to the context of logic programming. As a side-eeect, we show that higher-order uniication is a good tool for manipulating the function-lists. It appears that the eeciency of the program thus obtained relies critically upon the implementation of higher-order operations (uniication and reduction). In particular, we show that a good choice for data-structures and reduction strategy yields a linear na ve reverse.